Adaptive Anonymity via b-Matching

نویسندگان

  • Krzysztof Choromanski
  • Tony Jebara
  • Kui Tang
چکیده

The adaptive anonymity problem is formalized where each individual shares their data along with an integer value to indicate their personal level of desired privacy. This problem leads to a generalization of k-anonymity to the b-matching setting. Novel algorithms and theory are provided to implement this type of anonymity. The relaxation achieves better utility, admits theoretical privacy guarantees that are as strong, and, most importantly, accommodates a variable level of anonymity for each individual. Empirical results confirm improved utility on benchmark and social data-sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Anonymity via b-Matching

This supplement contains all necessary detailed proofs and a worst-case theoretical analysis in support of the main article. 7 Proof of theorem 1 Proof 1 In the first iteration, the algorithm is clearly solving Ĝ = argminG∈Gb h(G). Let G∗ = arg minG∈Gb s(G). Clearly, the number of stars is less than the Hamming distance s(G) ≤ h(G) for any G. Since Ĝ is the minimizer of h(G), we have h(Ĝ) ≤ h(G...

متن کامل

An Efficient Adaptive Boundary Matching Algorithm for Video Error Concealment

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

متن کامل

Fully Anonymous Profile Matching in Mobile Social Networks

In this paper, we study user profile matching with privacy-preservation in mobile social networks (MSNs) and introduce a family of novel profile matching protocols. We first propose an explicit Comparison-based Profile Matching protocol (eCPM) which runs between two parties, an initiator and a responder. The eCPM enables the initiator to obtain the comparisonbased matching result about a specif...

متن کامل

Adaptive Approximate Record Matching

Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...

متن کامل

The Information Revelation and Privacy in Online Social Networks

The client summary identical with privacy-preservation in movable community set of connections (msns) and begin a family of novel summary identical protocols. We first propose a clear Comparison-based summary identical protocol which runs between two parties, an originator and a responder. The summary identical protocol enables the originator to get hold of the comparison-based matching result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013